Fast and efficient computation of directional distance estimators

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Computation of Kernel Estimators

The computational complexity of evaluating the kernel density estimate (or its derivatives) at m evaluation points given n sample points scales quadratically as O(nm)–making it prohibitively expensive for large data sets. While approximate methods like binning could speed up the computation they lack a precise control over the accuracy of the approximation. There is no straightforward way of ch...

متن کامل

Fast Computation of Graph Edit Distance

The graph edit distance (GED) is a well-established distance measure widely used in many applications. However, existing methods for the GED computation suffer from several drawbacks including oversized search space, huge memory consumption, and lots of expensive backtracking. In this paper, we present BSS GED, a novel vertex-based mapping method for the GED computation. First, we create a smal...

متن کامل

Fast Distance Computation Using Quadratically Supported Surfaces

We use the class of surfaces with quadratic polynomial support functions in order to define bounding geometric primitives for shortest distance computation. The common normals of two such surfaces can be computed by solving a single polynomial equation of degree six. Based on this observation, we formulate an algorithm for computing the shortest distance between enclosures of two moving or stat...

متن کامل

Fast Distance Field Computation Using Graphics Hardware

We present an algorithm for fast computation of discretized 3D distance fields using graphics hardware. Given a set of primitives and a distance metric, our algorithm computes the distance field for each slice of a uniform spatial grid by rasterizing the distance functions of the primitives. We compute bounds on the spatial extent of the Voronoi region of each primitive. These bounds are used t...

متن کامل

Efficient Computation of Overlapping Variance Estimators for Simulation

Efficient Computation of Overlapping Variance Estimators for Simulation Christos Alexopoulos H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332, USA, [email protected] Nilay Tanık Argon Department of Industrial and Systems Engineering, University of Wisconsin–Madison, Madison, Wisconsin 53706-1572, USA, [email protected]....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Operations Research

سال: 2019

ISSN: 0254-5330,1572-9338

DOI: 10.1007/s10479-019-03163-9